Model checking Duration Calculus: a practical approach
نویسندگان
چکیده
منابع مشابه
A Practical Model Checking Approach Using FormalCheck
complies with the regulations of the University and meets the accepted standards with respect to originality and quality. Verification of industrial designs is becoming more challenging as technology advances and demand for higher performance increases. One of the most suitable debugging aids is automatic formal verification, which tests behaviors under all possible executions of a system. Howe...
متن کاملA Practical Approach to Coverage in Model Checking
In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a question of how complete the specification is, and whether it really covers all the behaviors of the system. In this paper we study coverage metrics for model checking from a practical point of view. Coverage metrics are ...
متن کاملPractical Model-Checking Using Games
We describe how model-checking games can be the foundation for eecient local model-checking of the modal mu-calculus on transition systems. Game-based algorithms generate winning strategies for a certain game, which can then be used interactively to help the user understand why the property is or is not true of the model. This kind of feedback has advantages over traditional techniques such as ...
متن کاملDistributed Symbolic Model Checking for µ-Calculus
In this paper we propose a distributed symbolic algorithm for model checking of propositional μ–calculus formulas. μ-calculus is a powerful formalism and many problems like (fair) CTL and LTL model checking can be solved using the μ–calculus model checking. Previous works on distributed symbolic model checking were restricted to reachability analysis and safety properties. This work thus signi£...
متن کاملModal -calculus, Model Checking and Gauu Elimination
In this paper we present a novel approach for solving Boolean equation systems with nested minimal and maximal xpoints. The method works by successively eliminating variables and reducing a Boolean equation system similar to Gauu elimination for linear equation systems. It does not require backtracking techniques. Within one framework we suggest a global and a local algorithm. In the context of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2008
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-008-0082-7